Reinhard Diestel
نویسنده
چکیده
dual, 88–89 graph, 3, 67, 76, 238 acyclic, 12, 60 adjacency matrix, 24 adjacent, 3 Ahuja, R.K., 145 algebraic colouring theory, 121 flow theory, 128–143 graph theory, ix, 20–25, 28 planarity criteria, 85–86 algorithmic graph theory, 145, 276–277, 281–282 almost, 238, 247–248 Alon, N., 106, 121–122, 249 alternating path, 29 walk, 52 antichain, 40, 41, 42, 252 Appel, K., 121 arboricity, 61, 99, 118 arc, 68 Archdeacon, D., 281 articulation point, see cutvertex at, 2 augmenting path for matching, 29, 40, 285 for network flow, 127, 144 automorphism, 3 average degree, 5 of bipartite planar graph, 289 bounded, 210 and chromatic number, 101, 106, 178, 185 and connectivity, 11 forcing minors, 169, 179, 184 forcing topological minors, 61, 170– 178 and girth, 237 and list colouring, 106 and minimum degree, 5–6 and number of edges, 5 and Ramsey numbers, 210 and regularity lemma, 154, 166 bad sequence, 252, 280 balanced, 243 Behzad, M., 122 Berge, C., 117 Berge graph, 117 between, 6, 68 Biggs, N.L., 28 bipartite graphs, 14–15, 27, 91, 95 edge colouring of, 103, 119 flow number of cubic, 133–134 forced as subgraph, 152, 160 list-chromatic index of, 109–110, 122 matching in, 29–34 in Ramsey theory, 202–203
منابع مشابه
Reinhard Diestel Graph Theory 4 th Electronic Edition 2010
This is a sample chapter of the eBook edition of the above Springer book, from their series Graduate Texts in Mathematics, vol. 173. In the English and German edition, the cross-references in the text and in the margins are active links. In this sample chapter, only those links will work that take you to another location in this chapter.
متن کاملReinhard Diestel Graph Theory 4
The cross-references in the text and in the margins are active links. When you see “Lemma 3.1”, for example, click on the “3.1” to be taken to that lemma. Feel free to print pages from this file for your personal use. If you intend to teach from this book, you may get your Department to purchase an additional “course notes” licence for this file. This will allow you to distribute handouts in cl...
متن کاملDuality Theorems for Blocks and Tangles in Graphs
We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph either has a large-order tangle or a certain low-width tree-decomposition witnessing that it cannot have such a tangle. Our result also yields duality theore...
متن کامل